Church/Turing hypothesis

Church/Turing hypothesis
гипотеза Чёрча-Тьюринга
любая имеющая решение вычислительная задача может быть решена соответственно запрограммированной машиной Тьюринга при наличии достаточного времени и объёма памяти. Другими словами, все цифровые компьютеры одинаковы по отношению к классам решаемых задач (но не по времени их решения). Это основополагающий принцип теории алгоритмов

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Поможем сделать НИР

Смотреть что такое "Church/Turing hypothesis" в других словарях:

  • Church–Turing–Deutsch principle — In computer science and quantum physics, the Church–Turing–Deutsch principle (CTD principle) is a stronger, physical form of the Church–Turing thesis formulated by David Deutsch in 1985. The principle states that a universal computing device can… …   Wikipedia

  • Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… …   Wikipedia

  • History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

  • History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… …   Wikipedia

  • Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… …   Wikipedia

  • Turing, Alan M. — ▪ English mathematician Introduction in full  Alan Mathison Turing  born June 23, 1912, London, England died June 7, 1954, Wilmslow, Cheshire  British mathematician and logician, who made major contributions to mathematics, cryptanalysis… …   Universalium

  • Turing completeness — For the usage of this term in the theory of relative computability by oracle machines, see Turing reduction. In computability theory, a system of data manipulation rules (such as an instruction set, a programming language, or a cellular… …   Wikipedia

  • Alan Turing — Turing redirects here. For other uses, see Turing (disambiguation). Alan Turing Turing at the time of his election to Fellowship of the Royal Society …   Wikipedia

  • CTH — steht für: Catalogue des Textes Hittites, ein Index zu hethitischen Texten Chalmers Tekniska Högskola, die Technische Hochschule Chalmers in Schweden Church Turing Hypothesis, englisch für die Church Turing These in der Theoretischen Informatik… …   Deutsch Wikipedia

  • Many-minds interpretation — The many minds interpretation of quantum mechanics extends the many worlds interpretation by proposing that the distinction between worlds should be made at the level of the mind of an individual observer. The concept was first introduced in 1970 …   Wikipedia

  • Digital physics — In physics and cosmology, digital physics is a collection of theoretical perspectives based on the premise that the universe is, at heart, describable by information, and is therefore computable. Therefore, the universe can be conceived as either …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»